A methodology for solving facility layout problem considering barriers: genetic algorithm coupled with A* search
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولan adapted harmony search based algorithm for facility layout optimization
this paper presents a strategy for using harmony search algorithm in facility layout optimization problems. in this paper an adapted harmony search algorithm is developed for solving facility layout optimization problems. this method finds an optimal facility arrangement in an existing layout. two real-world case studies are employed to demonstrate the efficiency of this model. a comparison is ...
متن کاملA Hybrid Simulated Annealing algorithm for Single Row Facility Layout Problem
This article addresses a single row facility layout problem where the objective is to optimize the arrangement of some rectangular facilities with different dimensions on a line. Regarding the NP-Hard nature of the considered problem, a hybrid meta-heuristic algorithm based on simulated annealing has been proposed to obtain a near optimal solution. A number of test problems are randomly generat...
متن کاملA Genetic Algorithm for Solving Multiple Warehouse Layout Problem
In this paper we present a genetic algorithm (GA) for solving NP-hard Multiple Warehouse Layout Problem (MLWLP). New encoding scheme with appropriate objective functions is implemented. Specific representation and modified genetic operators keep individuals correct and help in restoring good genetic material and avoiding premature convergence in suboptimal solutions. The algorithm is tested on ...
متن کاملA New Optimization via Invasive Weeds Algorithm for Dynamic Facility Layout Problem
The dynamic facility layout problem (DFLP) is the problem of finding positions of departments onthe plant floor for multiple periods (material flows between departments change during the planning horizon)such that departments do not overlap, and the sum of the material handling and rearrangement costs isminimized. In this paper a new optimization algorithm inspired from colonizing weeds, Invasi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Intelligent Manufacturing
سال: 2019
ISSN: 0956-5515,1572-8145
DOI: 10.1007/s10845-019-01468-x